Log-Linear Description Logics

نویسندگان

  • Mathias Niepert
  • Jan Nößner
  • Heiner Stuckenschmidt
چکیده

Log-linear description logics are a family of probabilistic logics integrating various concepts and methods from the areas of knowledge representation and reasoning and statistical relational AI. We define the syntax and semantics of log-linear description logics, describe a convenient representation as sets of first-order formulas, and discuss computational and algorithmic aspects of probabilistic queries in the language. The paper concludes with an experimental evaluation of an implementation of a log-linear DL reasoner.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning under Uncertainty with Log-Linear Description Logics

The position paper provides a brief summary of log-linear description logics and their applications. We compile a list of five requirements that we believe a probabilistic description logic should have to be useful in practice. We demonstrate the ways in which log-linear description logics answer to these requirements.

متن کامل

A Little Logic Goes a Long Way - Logical Reasoning in Web Data Integration and Ontology Learning

There is an ongoing dispute in the Semantic Web Community about the usefulness of (Description) Logic as a basis for describing data on the web. While researchers in logic argue with the benefits of logic in terms of a clean semantics and richness of the language, criticism against the use of logic normally focusses on two points: its computational complexity and its inability to represent soft...

متن کامل

Efficient maximum a-posteriori inference in Markov logic and application in description logics

The maximum a-posteriori (MAP) query in statistical relational models computes the most probable world given evidence and further knowledge about the domain. It is arguably one of the most important types of computational problems, since it is also used as a subroutine in weight learning algorithms. In this thesis, we discuss an improved inference algorithm and an application for MAP queries. W...

متن کامل

ELOG: A Probabilistic Reasoner for OWL EL

Log-linear description logics are probabilistic logics combining several concepts and methods from the areas of knowledge representation and reasoning and statistical relational AI. We describe some of the implementation details of the log-linear reasoner ELOG. The reasoner employs database technology to dynamically transform inference problems to integer linear programs (ILP). In order to lowe...

متن کامل

DL+log: Tight Integration of Description Logics and Disjunctive Datalog

The integration of Description Logics and Datalog rules presents many semantic and computational problems. In particular, reasoning in a system fully integrating Description Logics knowledge bases (DL-KBs) and Datalog programs is undecidable. Many proposals have overcomed this problem through a “safeness” condition that limits the interaction between the DL-KB and the Datalog rules. Such a safe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011